import java.util.Scanner;

class TreeNode{
    int val;
    TreeNode left;
    TreeNode right;

    public TreeNode(int val) {
        this.left = left;
        this.right = right;
    }
}
class Solution {
    private int preIndex = 0;
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        return buildTreeChild(preorder, inorder, 0, preorder.length-1);
    }
    private TreeNode buildTreeChild(int[] preorder, int[] inorder, int begin, int end) {
        if(begin > end) {
            return null;
        }
        int index = findIndex(inorder, preorder[preIndex], begin,end);
        TreeNode root = new TreeNode(preorder[preIndex]);

        preIndex++;

        root.left = buildTreeChild(preorder, inorder, begin, index-1);
        root.right = buildTreeChild(preorder, inorder, index+1, end);

        return root;
    }
    private int findIndex(int[] inorder, int target, int begin, int end) {
        for(int i = begin; i <= end; i++) {
            if(inorder[i] == target) {
                return i;
            }
        }
        return -1;
    }
}

public class Test {
    public static void main(String[] args) {
        int n,v;
        Scanner scanner = new Scanner(System.in);
        n = scanner.nextInt();
        v = scanner.nextInt();
        System.out.println(n/v);
    }
}





